negation by failure - significado y definición. Qué es negation by failure
Diclib.com
Diccionario ChatGPT
Ingrese una palabra o frase en cualquier idioma 👆
Idioma:

Traducción y análisis de palabras por inteligencia artificial ChatGPT

En esta página puede obtener un análisis detallado de una palabra o frase, producido utilizando la mejor tecnología de inteligencia artificial hasta la fecha:

  • cómo se usa la palabra
  • frecuencia de uso
  • se utiliza con más frecuencia en el habla oral o escrita
  • opciones de traducción
  • ejemplos de uso (varias frases con traducción)
  • etimología

Qué (quién) es negation by failure - definición

NON-MONOTONIC INFERENCE RULE IMPLYING THAT THE IMPOSSIBILITY TO DERIVE A STATEMENT ALLOWS TO INFER ITS NEGATION
Negation by failure; Weak negation

negation by failure         
An extralogical feature of Prolog and other {logic programming} languages in which failure of unification is treated as establishing the negation of a relation. For example, if Ronald Reagan is not in our database and we asked if he was an American, Prolog would answer "no". (1994-11-29)
Negation as failure         
Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive \mathrm{not}~p (i.e.
Negation         
OPERATION THAT TAKES A PROPOSITION P TO ANOTHER PROPOSITION "NOT P", WRITTEN ¬P, WHICH IS INTERPRETED INTUITIVELY AS BEING TRUE WHEN P IS FALSE, AND FALSE WHEN P IS TRUE; UNARY (SINGLE-ARGUMENT) LOGICAL CONNECTIVE
Logical not; Not (logic); ¬; Not sign; Negate; Logical NOT; ⌐; Negation sign; Logical negation; Negated; ¬; Logical Complement; Logical complement; Not operator; Logical Negation; ⌙; !vote; Logical opposite; Negation (mathematics); U+00AC; Negation (logic); Quantifier negation; Negation (logics); Negation elimination; ¬
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P, \mathord{\sim} P or \overline{P}. It is interpreted intuitively as being true when P is false, and false when P is true.

Wikipedia

Negation as failure

Negation as failure (NAF, for short) is a non-monotonic inference rule in logic programming, used to derive n o t   p {\displaystyle \mathrm {not} ~p} (i.e. that   p {\displaystyle ~p} is assumed not to hold) from failure to derive   p {\displaystyle ~p} . Note that n o t   p {\displaystyle \mathrm {not} ~p} can be different from the statement ¬ p {\displaystyle \neg p} of the logical negation of   p {\displaystyle ~p} , depending on the completeness of the inference algorithm and thus also on the formal logic system.

Negation as failure has been an important feature of logic programming since the earliest days of both Planner and Prolog. In Prolog, it is usually implemented using Prolog's extralogical constructs.

More generally, this kind of negation is known as weak negation, in contrast with the strong (i.e. explicit, provable) negation.